On Truncations For SZK Model
نویسندگان
چکیده
We consider a class of inhomogeneous Markovian queueing models with batch arrivals and group services. Bounds on the truncation errors in weak ergodic case are obtained. Two concrete queueing models are studied as examples.
منابع مشابه
On Truncations For A Class Of Finite Markovian Queuing Models
We consider a class of finite Markovian queueing models and obtain uniform approximation bounds of truncations. INTRODUCTION It is well known that explicit expressions for the probability characteristics of stochastic models can be found only in a few special cases, moreover, if we deal with an inhomogeneous Markovian model, then we must approximately calculate the limiting probability characte...
متن کاملOn Monotone Formula Closure of SZK
We investigate structural properties of statistical zero knowledge (SZK) both in the interactive and in the non-interactive model. Specifically, we look into the closure properties of SZK languages under monotone logical formula composition. This gives rise to new protocol techniques. We show that interactive SZK for random self reducible languages (RSR) (and for CO-RSR) is closed under monoton...
متن کاملAssessment of Egg Yolk Oil Extraction Methods of for ShiZhenKang Oil by Pharmacodynamic Index Evaluation.
To assess the extraction methods of egg yolk oil in ShiZhenKang (SZK) oil, which is used to treat eczema, a mice model of eczema was established by using 2,4-dinitrochlorobenzene (DNCB). The therapeutic effects of egg yolk oil extracted by different methods from SZK oil on the model of acute eczema in mice were evaluated. The oil yield rate of ethanol extraction is 42.06%. Its egg yolk oil is o...
متن کاملOn the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
Statistical Zero-knowledge proofs (Goldwasser, Micali and Rackoff, SICOMP 1989) allow a computationally unbounded server to convince a computationally limited client that an input x is in a language Π without revealing any additional information about x that the client cannot compute by herself. Randomized encoding (RE) of functions (Ishai and Kushilevitz, FOCS 2000) allows a computationally li...
متن کاملCan Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
We extend the study of non-interactive statistical zeroknowledge proofs. Our main focus is to compare the class NISZK of problems possessing such non-interactive proofs to the class SZK of problems possessing interactive statistical zero-knowledge proofs. Along these lines, we first show that if statistical zero knowledge is non-trivial then so is non-interactive statistical zero knowledge, whe...
متن کامل